A survey on book-embedding of planar graphs

The book-embedding problem arises in several area, such as very large scale integration (VLSI) design and routing multilayer printed circuit boards (PCBs). It can be used into various practical application fields. A book embedding of a graph G is an embedding of its vertices along the spine of a book, and an embedding of its edges to the pages such that edges embedded on the same page do not intersect. The minimum number of pages in which a graph G can be embedded is called the pagenumber or book-thickness of the graph G. It is an important measure of the quality for book-embedding. It is NP-hard to research the pagenumber of book-embedding for a graph G. This paper summarizes the studies on the book-embedding of planar graphs in recent years.     

Effect of quality control on the proliferation of the extract from Taraxacum mongolicum Hand.‐Mazz. in Lactobacillus plantarum

In recent years, the fingerprint of high‐performance liquid chromatography has been extensively applied in the identification and quality control of traditional Chinese medicine. It can be a potential protocol for assessing the authenticity, stability and consistency of traditional Chinese medicine and guaranteeing the expected biological activity. In this paper, a method using high‐performance liquid chromatography to identify and control the quality of the extract of Taraxacum mongolicum Hand.‐Mazz. (TME) was established. With this method, the correlation coefficients of the similarity of 10 batches were ≥0.994. The TME displayed a steady proliferative effect in Lactobacillus plantarum. In brief, this study successfully built a reliable, simple and efficient method to control and confirm the quality and the stability of biological activity of the TME.     

Binuclear copper(II) complex with 2-imidazolylbenzothiazole and bridged chloride ligands

1. Download : Download high-res image (81KB)
2. Download : Download full-size image

     

Expected reliability of communication protocols

We consider the problem of sending a message from a sender $s$ to a receiver $r$ through an unreliable network by specifying in a protocol what each vertex is supposed to do if it receives the message from one of its neighbors. A protocol for routing a message in such a graph is finite if it never floods $r$ with an infinite number of copies of the message. The expected reliability of a given protocol is the probability that a message sent from $s$ reaches $r$ when the edges of the network fail independently with probability $1?p$.We discuss, for given networks, the properties of finite protocols with maximum expected reliability in the case when $p$ is close to 0 or 1, and we describe networks for which no one protocol is optimal for all values of $p$. In general, finding an optimal protocol for a given network and fixed probability is challenging and many open problems remain.     

New lower bounds on the radius of spatial analyticity for the KdV equation

The radius of spatial analyticity for solutions of the KdV equation is studied. It is shown that the analyticity radius does not decay faster than $t^{?1/4}$ as time t goes to infinity. This improves the works of Selberg and da Silva (2017) [30] and Tesfahun (2017) [34]. Our strategy mainly relies on a higher order almost conservation law in Gevrey spaces, which is inspired by the I-method.     

A-posteriori KAM theory with optimal estimates for partially integrable systems

In this paper we present a-posteriori KAM results for existence of d-dimensional isotropic invariant tori for n-DOF Hamiltonian systems with additional $n?d$ independent first integrals in involution. We carry out a covariant formulation that does not require the use of action-angle variables nor symplectic reduction techniques. The main advantage is that we overcome the curse of dimensionality avoiding the practical shortcomings produced by the use of reduced coordinates, which may cause difficulties and underperformance when quantifying the hypotheses of the KAM theorem in such reduced coordinates. The results include ordinary and (generalized) iso-energetic KAM theorems. The approach is suitable to perform numerical computations and computer assisted proofs.     

Separation technique based on electrophoresis,chromatography and magnetism phenomena: the migration time and peak broadening

1. Download : Download high-res image (108KB)
2. Download : Download full-size image